Título: An implicit enumerative algorithm for solving the min-degree constrained minimum spanning tree problem
ثبت نشده
چکیده
Given a weighted undirected graph G=(V,E) with positive costs on the edges and a positive constant d, the min-degree constrained minimum spanning tree problem is to find a minimum cost spanning tree T of G where each node I of T either has degree at least d or is a leaf node. Thus, the goal is to find a spanning tree T where all its non-leaf nodes (or central nodes) have degree at least d. These central nodes are not given in advance, and the problem is to find the least cost spanning tree with the mentioned lower bounding degree propriety on the nodes.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملCross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident. One of the critical issues in the network design process is the topological design problem involved in establishing a centralized data communication network with best performance and low costs. It can be recognized as a degree-constrained minim...
متن کاملMin-degree constrained minimum spanning tree problem: complexity, properties, and formulations
Given an undirected graph G = (V,E) and a function d : V → N , the Min-Degree Constrained Minimum Spanning Tree (md-MST) problem is to find a minimum cost spanning tree T of G where each node i ∈ V has minimum degree d(i) or is a leaf node. This problem is closely related with the well-known Degree Constrained Minimum Spanning Tree (d-MST) problem, where the degree constraint is an upper limit ...
متن کاملVariable neighborhood search for the degree-constrained minimum spanning tree problem
Given an undirected graph with weights associated with its edges, the degree-constrained minimum spanning tree problem consists in nding a minimum spanning tree of the given graph, subject to constraints on node degrees. We propose a variable neighborhood search heuristic for the degree-constrained minimum spanning tree problem, based on a dynamic neighborhood model and using a variable neighbo...
متن کامل